Parallelization of the Cuckoo Search Using CUDA Architecture
نویسندگان
چکیده
Cuckoo Search is one of the recent swarm itelligence metaheuritics. It has been succesfuly applied to a number of optimization problems, but is stil not very well researched. In this paper we present a parallelized version of the Cuckoo Search algorithm. The parallelization is implemented using CUDA architecture. The algorithm is significantly changed compared to the sequential version. Changes are partialy done to exploit the power of mass parallelization by the graphical processing unit and partialy as a consequence of the memory access restrictions that exist in CUDA. Tests on standard benchmark functions show that our proposed parallized algorithm greatly decreases the execution time and achieves similar or slightly better quality of the results compared to the sequential algorithm. Key–Words: Cuckoo search, Swarm intelligence, Optimization metaheuristics, Parallel algorithms
منابع مشابه
Parallelization of Rich Models for Steganalysis of Digital Images using a CUDA-based Approach
There are several different methods to make an efficient strategy for steganalysis of digital images. A very powerful method in this area is rich model consisting of a large number of diverse sub-models in both spatial and transform domain that should be utilized. However, the extraction of a various types of features from an image is so time consuming in some steps, especially for training pha...
متن کاملAn approach to Improve Particle Swarm Optimization Algorithm Using CUDA
The time consumption in solving computationally heavy problems has always been a concern for computer programmers. Due to simplicity of its implementation, the PSO (Particle Swarm Optimization) is a suitable meta-heuristic algorithm for solving computationally heavy problems. However, despite the simplicity, the algorithm is inefficient for solving real computationally heavy problems but the pr...
متن کاملEfficient parallelization of the genetic algorithm solution of traveling salesman problem on multi-core and many-core systems
Efficient parallelization of genetic algorithms (GAs) on state-of-the-art multi-threading or many-threading platforms is a challenge due to the difficulty of schedulation of hardware resources regarding the concurrency of threads. In this paper, for resolving the problem, a novel method is proposed, which parallelizes the GA by designing three concurrent kernels, each of which running some depe...
متن کاملMPI- and CUDA- implementations of modal finite difference method for P-SV wave propagation modeling
Among different discretization approaches, Finite Difference Method (FDM) is widely used for acoustic and elastic full-wave form modeling. An inevitable deficit of the technique, however, is its sever requirement to computational resources. A promising solution is parallelization, where the problem is broken into several segments, and the calculations are distributed over different processors. ...
متن کاملParallelized Cuckoo Search Algorithm for Unconstrained Optimization
Modifications that introduce parallelization of standard cuckoo search algorithm are proposed in this paper. Basic form of the cuckoo search algorithm has already shown great potential for optimization problems, especially when applied to unconstrained continuous functions. In this paper two aspects of parallelization are proposed. The first one addresses the performance issue, while the second...
متن کامل